package com.itgt.train;

public class Sorter_cn {

	public void traversal( int[] array ){
		if( array != null && array.length > 0 ) {
	        for( int i = 0 ; i < array.length ; i++ ){
	            System.out.print( array[ i ] );
	            System.out.print( ( i < array.length - 1 ) ? " , " : "" );
	        }
	        System.out.println();
	    }
	}
	
	public void sort( int[] array ) {
		for( int i = 0; i < array.length-1;i++) {
			for (int j = 0; j < array.length-1-i; j++) {
				if(array[j] > array[j+1]) {
					int temp = array[j+1];
					array[j+1] = array[j];
					array[j] = temp;
				}
			}
		}
	}
	public static void main(String[] args) {
		Sorter_cn sorter = new Sorter_cn();

		int[] a = { 1 , 100 , -20 , 99 , 1000 , 0 , 30 };
		System.out.print( "排序前 : " );
		sorter.traversal( a ); // 排序前 : 1 , 100 , -20 , 99 , 1000 , 0 , 30

		sorter.sort( a ) ;
		System.out.print( "排序后 : " );
		sorter.traversal( a ); // 排序后 : -20 , 0 , 1 , 30 , 99 , 100 , 1000
	}

}
